Weighted Linear Matroid Parity
نویسنده
چکیده
منابع مشابه
Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity
Mader’s disjoint S-paths problem unifies two generalizations of bipartite matching: (a) nonbipartite matching and (b) disjoint s–t paths. Lovász (1980, 1981) first proposed an efficient algorithm for this problem via a reduction to matroid matching, which also unifies two generalizations of bipartite matching: (a) non-bipartite matching and (c) matroid intersection. While the weighted versions ...
متن کاملParallel Complexity for Matroid Intersection and Matroid Parity Problems
Let two linear matroids have the same rank in matroid intersection. A maximum linear matroid intersection (maximum linear matroid parity set) is called a basic matroid intersection (basic matroid parity set), if its size is the rank of the matroid. We present that enumerating all basic matroid intersections (basic matroid parity sets) is in NC, provided that there are polynomial bounded basic m...
متن کاملSolving the Linear Matroid Parity Problem as a Sequence of Matroid Intersection Problems
In this paper, we present an O(r n) algorithm for the linear matroid parity problem. Our solution technique is to introduce a modest generalization, the non-simple parity problem, and identify an important subclass of non-simple parity problems called 'easy' parity problems which can be solved as matroid intersection problems. We then show how to solve any linear matroid parity problem parametr...
متن کاملThe linear delta-matroid parity problem
This paper addresses a generalization of the matroid parity problem to delta-matroids. We give a minimax relation, as well as an efficient algorithm, for linearly represented deltamatroids. These are natural extensions of the minimax theorem of Lovász and the augmenting path algorithm of Gabow and Stallmann for the linear matroid parity problem. r 2003 Elsevier Science (USA). All rights reserved.
متن کاملA Fast, Simpler Algorithm for the Matroid Parity Problem
Consider a matrix with m rows and n pairs of columns. The linear matroid parity problem (LMPP) is to determine a maximum number of pairs of columns that are linearly independent. We show how to solve the linear matroid parity problem as a sequence of matroid intersection problems. The algorithm runs in O(mn). Our algorithm is comparable to the best running time for the LMPP, and is far simpler ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017